The Weight Equations for Binary Linear Codes ∗
نویسنده
چکیده
The system of weight equations for a binary (n,m)-code with respect to its ordered basis is introduced. It connects certain quantities (characteristics) related to the basis with the weights of non-zero words in the code. It is shown that the portion involving the variables does not depend neither on the code nor on the basis. Explicit forms of the matrix of coefficients in the system and its inverse matrix are computed.
منابع مشابه
Partial Epstein zeta functions on binary linear codes and their functional equations
In this paper, partial Epstein zeta functions on binary linear codes, which are related with Hamming weight enumerators of binary linear codes, are newly defined. Then functional equations for those zeta functions on codes are presented. In particular, it is clarified that simple functional equations hold for partial Epstein zeta functions on binary linear self-dual codes.
متن کاملBinary linear complementary dual codes
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual [n, k] codes with the largest minimum weight among all binary linear complementary dual [n, k] codes. We characterize binary linear complementary dual codes with the largest minimum weight for small dimensions. A complete ...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملBinary linear codes with at most 4 weights
For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight distribution is determined. Results show that they are at most 4-weight linear codes. Additionally, these codes can be used in secret sharing schemes. Index...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کامل